Voting Theory for Concept Detection
نویسندگان
چکیده
This paper explores the issue of detecting concepts for ontology learning from text. We investigate various metrics from graph theory and propose various voting schemes based on these metrics. The idea draws its root in social choice theory, and our objective is to mimic consensus in automatic learning methods and increase the confidence in concept extraction through the identification of the best performing metrics, the comparison of these metrics with standard information retrieval metrics (such as TF-IDF) and the evaluation of various voting schemes. Our results show that three graph-based metrics Degree, Reachability and HITS-hub were the most successful in identifying relevant concepts contained in two gold standard ontologies.
منابع مشابه
An improved approach for ranking the candidates in a voting system based on efficiency intervals
This paper proposes improvements and revisions to a recent approach in a voting system, and provides an effective approach with a stronger discriminate power. For this purpose, the advantage of a linear transformation is utilized to redene a previously used concept of virtual worst candidate, by incorporating the existing weight restrictions. Then, the best score of this virtual candidate is us...
متن کاملA Novel Ensemble Approach for Anomaly Detection in Wireless Sensor Networks Using Time-overlapped Sliding Windows
One of the most important issues concerning the sensor data in the Wireless Sensor Networks (WSNs) is the unexpected data which are acquired from the sensors. Today, there are numerous approaches for detecting anomalies in the WSNs, most of which are based on machine learning methods. In this research, we present a heuristic method based on the concept of “ensemble of classifiers” of data minin...
متن کاملApproval voting: three examples
In this paper we discuss three examples of approval voting games. The first one illustrates that a stronger solution concept than perfection is needed for a strategic analysis of this type of games. The second example shows that sophisticated voting can imply that the Condorcet winner gets no vote. The third example shows the possibility of insincere voting being a stable equilibrium.
متن کاملVoting Detector: A Combination of Anomaly Detectors to Reveal Annotation Errors in TTS Corpora
Anomaly detection techniques were shown to help in detecting word-level annotation errors in read-speech corpora for textto-speech synthesis. In this framework, correctly annotated words are considered as normal examples on which the detection methods are trained. Misannotated words are then taken as anomalous examples which do not conform to normal patterns of the trained detection models. In ...
متن کاملHarmonic Filters in 3D - Theory and Applications
This report proposes a concept for SE(3)-equivariant non-linear filters for multiple purposes, especially in the context of feature and object detection. The idea of the approach is to compute local descriptors as projections onto a local harmonic basis. These descriptors are mapped in a non-linear way onto new local harmonic representations, which then contribute to the filter output in a line...
متن کامل